#include<iostream>
using namespace std;
#include<vector>


int maxProfit(int k, vector<int>& p) {
	int length1 = p.size();

	int k = min(k, length1 / 2);
	vector<int> temp(k, 0);
	vector<vector<int>>dp1(length1, temp);

	vector<vector<int>>dp2(length1, temp);

	dp1[0][0] = -p[0];

	for (int i = 1; i < length1; i++)
	{
		for (int j = 1; j < i; j++)
		{
			
		}
	}

}

int main()
{
	return 0;
}